Cactus: A Branching-Time Logic Programming Language
نویسندگان
چکیده
Temporal programming languages are recognized as natu ral and expressive formalisms for describing dynamic systems However most such languages are based on linear ow of time a fact that makes them unsuitable for certain types of applications In this paper we in troduce the new temporal logic programming language Cactus which is based on a branching notion of time In Cactus the truth value of a predicate depends on a hidden time parameter which has a tree like structure As a result Cactus appears to be especially appropriate for expressing non deterministic computations or generally algorithms that involve the manipulation of tree data structures
منابع مشابه
Linear Time Datalog for Branching Time Logic
In this paper we show that Datalog is well-suited as a temporal veriication language. Dat-alog is a well-known database query language relying on the logic programming paradigm. We introduce Datalog LITE, a fragment of Datalog with well-founded negation, and present a linear time model checking algorithm for Datalog LITE. We show that Datalog LITE subsumes temporal languages such as CTL and the...
متن کاملGiorgio Levi ’ s Festschrift Workshop
3 • To understand the work of Giorgio Levi on the semantics of logic programming languages for static analysis • By reconstructing the semantics of Resolution-based/ Logic Programming... ...by abstract interpretations of a concrete semantics ...chosen to be a branching-time trace-based semantics (built from a state transition system) • In passing, we get some novel semantics that tackle impure ...
متن کاملVerifying Dribble Agents
We describe a model-checking based approach to verification of programs written in the agent programming language Dribble. We define a logic (an extension of the branching time temporal logic CTL) which describes transition systems corresponding to a Dribble program, and show how to express properties of the agent program in the logic and how to encode transition systems as an input to a model-...
متن کاملTowards model checking OCL
This paper presents a logic, called BOTL (Object-Based Temporal Logic), that facilitates the specification of dynamic and static properties of object-based systems. The logic is based on the branching temporal logic CTL and the Object Constraint Language (OCL). Eventually, the aim is to do model checking. The formal semantics of BOTL is defined in terms of a general operational model that is ai...
متن کاملA Value-propagating Transformation Technique for Datalog Programs Based on Non-Deterministic Constructs
The branching-time transformation is a recent technique for optimizing Chain Datalog programs. In this paper we propose a significant extension of the branching-time transformation which we believe opens up a promising new direction of research in the area of value-propagating Datalog optimizations. More specifically, the proposed transformation can handle more general programs that allow multi...
متن کامل